Reconstructing Permutations from Identification Minors
نویسنده
چکیده
We consider the problem whether a permutation of a finite set is uniquely determined by its identification minors. While there exist non-reconstructible permutations of every set with two, three, or four elements, we show that every permutation of a finite set with at least five elements is reconstructible from its identification minors. Moreover, we provide an algorithm for recovering a permutation from its deck. We also discuss a generalization of this reconstruction problem, as well as the related set-reconstruction problem.
منابع مشابه
Reconstructing Permutations from Cycle Minors
The ith cycle minor of a permutation p of the set {1, 2, . . . , n} is the permutation formed by deleting an entry i from the decomposition of p into disjoint cycles and reducing each remaining entry larger than i by 1. In this paper, we show that any permutation of {1, 2, . . . , n} can be reconstructed from its set of cycle minors if and only if n ≥ 6. We then use this to provide an alternate...
متن کاملPermutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible way to obtain (n k ) subsequences. We renumber the sequences from 1 to n−k preserving the relative size of the elements to form (n−k)-minors. These minors form a multiset Mk(p) with an underlying set M ′ k(p). We study ...
متن کاملReconstructing Multisets over Commutative Groupoids and Affine Functions over Nonassociative Semirings
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of multisets are determined. These results find an application in a different kind of reconstruction problem for functions of several arguments and identification min...
متن کاملCombinatorics of Maximal Minors
We continue the study of the Newton polytope Pm,n of the product of all maximal minors of an m x n-matrix of indeterminates. The vertices of Pm,n are encoded by coherent matching fields A = (A z) , where z runs over all m-element subsets of columns, and each Az is a bijection z —> [m]. We show that coherent matching fields satisfy some axioms analogous to the basis exchange axiom in the matroid...
متن کامل1 J an 2 00 5 Combinatoric of H - primes in quantum matrices
Let n be a positive integer greater than or equal to 2, and q ∈ C transcendental over Q. In this paper, we give an algorithmic construction of an ordered bijection between the set of H-primes of Oq (Mn(C)) and the sub-poset S of the (reverse) Bruhat order of the symmetric group S2n consisting of those permutations that move any integer by no more than n positions. Further, we describe the permu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015